Minmax regret bottleneck problems with solution-induced interval uncertainty structure
نویسندگان
چکیده
منابع مشابه
Minmax regret solutions for minimax optimization problems with uncertainty
We propose a general approach for nding minmax regret solutions for a class of combinatorial optimization problems with an objective function of minimax type and uncertain objective function coe cients. The approach is based on reducing a problem with uncertainty to a number of problems without uncertainty. The method is illustrated on bottleneck combinatorial optimization problems, minimax mul...
متن کاملSome tractable instances of interval data minmax regret problems
In this paper, we provide polynomial and pseudopolynomial algorithms for classes of particular instances of interval data minmax regret graph problems. These classes are defined using a parameter that measures the distance from well known solvable instances. Tractable cases occur when the parameter is bounded by a constant.
متن کاملThe Minmax Regret Shortest Path Problem with Interval Arc Lengths
This paper considers the shortest path problem on directed acyclic graphs, where the uncertainty of input data (lengths of arcs) is modeled in the form of intervals. In order to handle the interval data the minmax criterion to the regret values is applied, where the original objective function with interval coefficients is transformed into that of finding the least maximum worst-case regret, wh...
متن کاملDiscrete Optimization with Interval Data - Minmax Regret and Fuzzy Approach
One day, you will discover a new adventure and knowledge by spending more money. But when? Do you think that you need to obtain those all requirements when having much money? Why don't you try to get something simple at first? That's something that will lead you to know more about the world, adventure, some places, history, entertainment, and more? It is your own time to continue reading habit....
متن کاملA double oracle approach to minmax regret optimization problems with interval data
In this paper, we provide a generic anytime lower bounding procedure for minmax regret optimization problems. We show that the lower bound obtained is always at least as accurate as the lower bound recently proposed by Chassein and Goerigk [2]. The validity of the bound is based on game theoretic arguments and its computation is performed via a double oracle algorithm [6] that we specify. The l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2010
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2010.03.007